Distributed trigger counting algorithms for arbitrary network topology
نویسندگان
چکیده
منابع مشابه
A Trigger Counting Mechanism for Ring Topology
Consider a distributed system with n processors, which receive triggers from the outside world. The Distributed Trigger Counting (DTC) problem is to raise an alarm if the number of triggers over the system reaches w, which is an user specified input. DTC is used as a primitive operation in many applications, such as distributed monitoring, global snapshot etc. In this paper, we propose an algor...
متن کاملAn Optimal Decentralized Algorithm for the Distributed Trigger Counting Problem
We study the distributed trigger counting problem. In this problem, we have a distributed system having n processors. These processors receive triggers from an external source. The goal is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. The problem has applications in monitoring, global snapshots and other d...
متن کاملAn Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem
Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. The problem has applications in monitoring, global snapshots, synchronizers and other distribute...
متن کاملImproved Algorithms for Network Topology Discovery
Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. However, little consideration has been given as to how to perform large-scale topology discovery efficiently and in a network-friendly manner. In prior work, we have described how large numbers of traceroute monitors can coordinate their efforts to map the network while reducing their im...
متن کاملDistributed algorithms for dynamic topology construction and their applications
We introduce new distributed algorithms that dynamically construct network topologies. These algorithms not only adapt to dynamic topologies where nodes join and leave, but also actively set up and remove links between the nodes, to achieve certain global graph properties. First, we present a novel distributed algorithm for constructing overlay networks that are composed of d Hamilton cycles. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2016
ISSN: 1530-8669
DOI: 10.1002/wcm.2698